Memento: Making Sliding Windows Efficient for Heavy Hitters

نویسندگان

چکیده

Cloud operators require timely identification of Heavy Hitters (HH) and Hierarchical (HHH) for applications such as load balancing, traffic engineering, attack mitigation. However, existing techniques are slow in detecting new heavy hitters. In this paper, we present the case identifying hitters through sliding windows . Sliding windows quicker more accurate to detect than current interval-based methods, but date had no practical algorithms. Accordingly, introduce, design, analyze xmlns:xlink="http://www.w3.org/1999/xlink">Memento family sliding window algorithms HH HHH problems single-device network-wide settings. We use extensive evaluations show that our solutions orders magnitude faster comparable speed state-of-the-art non-windowed sampling based technique. Furthermore, exemplify detection capabilities on a realistic testbed. To end, implemented Memento an open-source extension popular HAProxy cloud load-balancer. evaluations, using HTTP flood by 50 subnets, approach detected subnets reduced number undetected requests up $37\times $ compared alternatives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Catch L 2-Heavy-Hitters on Sliding Windows

Finding heavy-elements (heavy-hitters) in streaming data is one of the central, and well-understood tasks. Despite the importance of this problem, when considering the sliding windows model of streaming (where elements eventually expire) the problem of finding L2-heavy elements has remained completely open despite multiple papers and considerable success in finding L1-heavy elements. In this pa...

متن کامل

Efficient Summing over Sliding Windows

This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1’s in the last W bits of a binary stream is considered. A lower bound of Ω( 1 +logW ) memory bits forW -additive approximations is derived. This is followed by an algorithm whose memory consumption is O( 1 + logW ) bits, indicating that th...

متن کامل

Efficient Error-Correcting Codes for Sliding Windows

We consider the task of transmitting a data stream in the sliding window model, where communication takes place over an adversarial noisy channel with noise rate up to 1. For any noise level c < 1 we design an efficient encoding scheme, such that for any window in which the noise level does not exceed c, the receiving end decodes at least a (1−c−ε)-prefix of the window, for any small ε > 0. Dec...

متن کامل

Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection

Motivated by a recent new type of randomized Distributed Denial of Service (DDoS) attacks on the Domain Name Service (DNS), we develop novel and efficient distinct heavy hitters algorithms and build an attack identification system that uses our algorithms. Heavy hitter detection in streams is a fundamental problem with many applications, including detecting certain DDoS attacks and anomalies. A...

متن کامل

Distributed Private Heavy Hitters

In this paper, we give efficient algorithms and lower bounds for solving the heavy hitters problem while preserving differential privacy in the fully distributed local model. In this model, there are n parties, each of which possesses a single element from a universe of size N . The heavy hitters problem is to find the identity of the most common element shared amongst the n parties. In the loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE ACM Transactions on Networking

سال: 2022

ISSN: ['1063-6692', '1558-2566']

DOI: https://doi.org/10.1109/tnet.2021.3132385